Subdivision schemes with general dilation in the geometric and nonlinear setting
نویسنده
چکیده
We establish results on convergence and smoothness of subdivision rules operating on manifoldvalued data which are based on a general dilation matrix. In particular we cover irregular combinatorics. For the regular grid case results are not restricted to isotropic dilation matrices. The nature of the results is that intrinsic subdivision rules which operate on geometric data inherit smoothness properties of their linear counterparts.
منابع مشابه
Log-exponential Analogues of Univariate Subdivision Schemes in Lie Groups and their Smoothness Properties
The necessity to process data which live in nonlinear geometries (e.g. motion capture data, unit vectors, subspaces, positive definite matrices) has led to some recent developments in nonlinear multiscale representation and subdivision algorithms. The present paper analyzes convergence and C and C smoothness of subdivision schemes which operate in matrix groups or general Lie groups, and which ...
متن کاملSmoothness of non-linear and non-separable subdivision schemes
We study in this paper nonlinear subdivision schemes in a multivariate setting allowing arbitrary dilation matrix. We investigate the convergence of such iterative process to some limit function. Our analysis is based on some conditions on the contractivity of the associated scheme for the differences. In particular, we show the regularity of the limit function, in L and Sobolev spaces.
متن کاملNonlinear subdivision through nonlinear averaging
We investigate a general class of nonlinear subdivision algorithms for functions of a real or complex variable built from linear subdivision algorithms by replacing binary linear averages such as the arithmetic mean by binary nonlinear averages such as the geometric mean. Using our method, we can easily create stationary subdivision schemes for Gaussian functions, spiral curves, and circles wit...
متن کاملA General Proximity Analysis of Nonlinear Subdivision Schemes
In recent work nonlinear subdivision schemes which operate on manifold-valued data have been successfully analyzed with the aid of so-called proximity conditions bounding the difference between a linear scheme and the nonlinear one. The main difficulty with this method is the verification of these conditions. In the present paper we obtain a very clear understanding of which properties a nonlin...
متن کاملNonlinear subdivision schemes in irregular meshes
The present article deals with convergence and smoothness analysis of geometric, nonlinear, subdivision schemes in the presence of extraordinary points. For a certain class of stationary linear subdivision schemes we can show that if a convergent linear scheme and its nonlinear analogue meet a proximity condition, then the nonlinear scheme converges for dense enough input data. Furthermore, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Approximation Theory
دوره 164 شماره
صفحات -
تاریخ انتشار 2012